Entanglement of free fermions on Hamming graphs

نویسندگان

چکیده

Free fermions on Hamming graphs H(d,q) are considered and the entanglement entropy for two types of subsystems is computed. For subsets vertices that form subgraphs, an analytical expression obtained. corresponding to a neighborhood, i.e. set sites at fixed distance from reference vertex, decomposition in irreducible submodules Terwilliger algebra also yields closed formula entropy. Finally, made out multiple neighborhoods, it shown how construct block-tridiagonal operator which commutes with Hamiltonian. It identified as BC-Gaudin magnet Hamiltonian magnetic field diagonalized by modified algebraic Bethe ansatz.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On spanning tree congestion of Hamming graphs

We present a tight lower bound for the spanning tree congestion of Hamming graphs.

متن کامل

Distilling Entanglement from Fermions

Since Fermions are based on anti-commutation relations, their entanglement can not be studied in the usual way, such that the available theory has to be modified appropriately. Recent publications consider in particular the structure of separable and of maximally entangled states. In this talk we want to discuss local operations and entanglement distillation from bipartite, Fermionic systems. T...

متن کامل

On Robust Colorings of Hamming-Distance Graphs

Hq(n, d) is defined as the graph with vertex set Zq and where two vertices are adjacent if their Hamming distance is at least d. The chromatic number of these graphs is presented for various sets of parameters (q, n, d). For the 4-colorings of the graphs H2(n, n − 1) a notion of robustness is introduced. It is based on the tolerance of swapping colors along an edge without destroying properness...

متن کامل

On k-partitioning of Hamming Graphs

We consider the graphs Hn a defined as the Cartesian products of n complete graphs with a vertices each. Let an edge cut partition the vertex set of a graph into k subsets A1, . . . , Ak with ||Ai| − |Aj || ≤ 1. We consider the problem of determining the minimal size of such a cut for the graphs defined above and present bounds and asymptotic results for some specific values of k.

متن کامل

Neighbour transitivity on codes in Hamming graphs

We consider a code to be a subset of the vertex set of a Hamming graph. In this setting a neighbour of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the set of neighbours of the code. We call these codes neighbour transitive. We obtain sufficient conditions for a neigh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nuclear Physics B

سال: 2023

ISSN: ['1873-1562', '0550-3213']

DOI: https://doi.org/10.1016/j.nuclphysb.2022.116061